Deciding Polyhedrality of Spectrahedra
نویسندگان
چکیده
Spectrahedra are linear sections of the cone of positive semidefinite matrices which, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We generalize and strengthen results of [M. V. Ramana, Polyhedra, spectrahedra, and semidefinite programming, in Topics in Semidefinite and Interior-Point Methods, Fields Inst. Commun. 18, AMS, Providence, RI, 1998, pp. 27–38] regarding the structure of spectrahedra, and we devise a normal form of representations of spectrahedra. This normal form is effectively computable and leads to an algorithm for deciding polyhedrality.
منابع مشابه
Polyhedra, Spectrahedra, and Semideenite Programming
A spectrahedron is the feasible region of a semideenite program. In this paper, we investigate the conditions under which a given spectrahedron is polyhedral. Characterizations of those matrix maps for which the associated spectrahedron is polyhedral are derived. It is then shown that, while polyhedrality is CoNP-Hard to detect in general, under certain assumptions, it can be recognized in rand...
متن کاملSome geometric results in semidefinite programming
The purpose of this paper is to develop certain geometric results concerning the feasible regions of Semideenite Programs, called here Spectrahedra. We rst develop a characterization for the faces of spectrahedra. More speciically, given a point x in a spectrahedron, we derive an expression for the minimal face containing x. Among other things, this is shown to yield characterizations for extre...
متن کاملPositive Polynomials and Projections of Spectrahedra
This work is concerned with different aspects of spectrahedra and their projections, sets that are important in semidefinite optimization. We prove results on the limitations of so called Lasserre and theta body relaxation methods for semialgebraic sets and varieties. As a special case we obtain the main result of [19] on non-exposed faces. We also solve the open problems from that work. We fur...
متن کاملSpectrahedra and Convex Hulls of Rank-One Elements
The Helton-Nie Conjecture (HNC) is the proposition that every convex semialgebraic set is a spectrahedral shadow. Here we prove that HNC is equivalent to another proposition related to quadratically constrained quadratic programming. Namely, that the convex hull of the rank-one elements of any spectrahedron is a spectrahedral shadow. In the case of compact convex semialgebraic sets, the spectra...
متن کاملThe Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
It is well-know that the Chvátal-Gomory (CG) closure of a rational polyhedron is a rational polyhedron. In this paper, we show that the CG closure of a bounded full-dimensional ellipsoid, described by rational data, is a rational polytope. To the best of our knowledge, this is the first extension of the polyhedrality of the CG closure to a nonpolyhedral set. A key feature of the proof is to ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 25 شماره
صفحات -
تاریخ انتشار 2015